package exercise;

import java.util.Arrays;

/**
 * https://leetcode.cn/problems/merge-sorted-array/
 */
public class Test3 {
    public static void merge(int[] nums1, int m, int[] nums2, int n) {
        int i = m - 1, j = n - 1, k = m + n - 1;
        while(i >= 0 && j >= 0){
            if(nums1[i] > nums2[j]){
                nums1[k--] = nums1[i--];
            }else{
                nums1[k--] = nums2[j--];
            }
        }
        while(i >= 0){
            nums1[k--] = nums1[i--];
        }
        while(j >= 0){
            nums1[k--] = nums2[j--];
        }
    }

    public static void main(String[] args) {
        int[] m = {1, 3, 7, 9, 0, 0, 0, 0, 0, 0};
        int[] n = {1, 2,  5, 6, 8, 10};
        merge(m, 4, n, n.length);
        System.out.println(Arrays.toString(m));
    }
}
